Convexity and Sumsets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projections, entropy and sumsets

In this paper we have shall generalize Shearer’s entropy inequality and its recent extensions by Madiman and Tetali, and shall apply projection inequalities to deduce extensions of some of the inequalities concerning sums of sets of integers proved recently by Gyarmati, Matolcsi and Ruzsa. We shall also discuss projection and entropy inequalities and their connections.

متن کامل

Monochromatic sumsets

LEMMA . At most (kn)'g"ulk k-sets Sc [ n ] have IP(S)I <u . Proof. Let a,< . . . < a k denote the elements of S. Call i doubling if P(a, , . . ., a i) has double the size of P(a, , . . ., a i 1 ) . There are at most lg u doubling i. Hence there are at most k'g" choices for doubling positions i and at most n'g" choices for the values a i . If i is not doubling then a i = x y, where x, y E P(a, ,...

متن کامل

On Various Restricted Sumsets

For finite subsets A1, . . . , An of a field, their sumset is given by {a1+ · · ·+an : a1 ∈ A1, . . . , an ∈ An}. In this paper we study various restricted sumsets of A1, . . . , An with restrictions of the following forms: ai − aj 6∈ Sij , or αiai 6= αjaj , or ai + bi 6≡ aj + bj (mod mij). Furthermore, we gain an insight into relations among recent results on this area obtained in quite differ...

متن کامل

Sumsets of sparse sets

Let σ be a constant in the interval (0, 1), and let A be an infinite set of positive integers which contains at least c1x σ and at most c2x σ elements in the interval [1, x] for some constants c2 > c1 > 0 independent of x and each x ≥ x0. We prove that then the sumset A + A has more elements than A (counted up to x) by a factor c(σ) √ log x/ log log x for x large enough. An example showing that...

متن کامل

Near convexity, metric convexity, and convexity

It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2000

ISSN: 0022-314X

DOI: 10.1006/jnth.1999.2386